- theorem prover
- программа для доказательства теорем (с использованием аксиоматической базы данных)
English-Russian electronics dictionary .
theorem prover
Смотреть что такое "theorem prover" в других словарях:
Isabelle (theorem prover) — Infobox Software name = Isabelle caption = collapsible = author = developer = released = latest release version = latest release date = latest maintenance version = latest maintenance date = latest preview version = latest preview date =… … Wikipedia
Lean theorem prover — A lean theorem prover is an automated theorem prover implemented in a minimum amount of code. Lean provers are generallyfact|date=December 2007 implemented in Prolog, and make proficient use of the backtracking engine and logic variables of that… … Wikipedia
Otter (theorem prover) — Otter is an automated theorem prover developed by William McCune at Argonne National Laboratory in Illinois. Otter was the first widely distributed, high performance theorem prover for first order logic, and it pioneered a number of important… … Wikipedia
E equational theorem prover — E is a modern, high performance theorem prover for full first order logic with equality. It has been developed primarily in the Automated Reasoning Group at TU Munich.The system is based on the equational superposition calculus. In contrast to… … Wikipedia
Vampire theorem prover — Vampire is an automatic theorem prover for first order classical logic developed in the Computer Science Department of the University of Manchester by Prof. Andrei Voronkov previously together with Dr. Alexandre Riazanov. It has won the world cup … Wikipedia
LCF (theorem prover) — LCF (Logic for Computable Functions) is an interactive automated theorem prover developed at the universities of Edinburgh and Stanford by Robin Milner and others. LCF introduced the general purpose programming language ML to allow users to write … Wikipedia
SNARK theorem prover — SNARK, SRI s New Automated Reasoning Kit, is a theorem prover for multi sorted first order logic intended for applications in artificial intelligence and software engineering. SNARK s principal inference mechanisms are resolution and… … Wikipedia
Tau (theorem prover) — Tau is a robust and general purpose, interactive (live on the web), user configurable automated theorem prover for first order predicate logic with equality. Tau proves both theorems and arguments expressed in unrestricted first order notation in … Wikipedia
Agda (theorem prover) — Agda is a theorem prover, i.e. a computer program that can check mathematical proofs. More specifically, it is an interactive system for developing constructive proofs in a variant of Per Martin Löf s Type Theory. It can also be seen as a… … Wikipedia
Gandalf (theorem prover) — Gandalf is a first order automated theorem prover applied to several domain specifictasks such as Semantic web. It has also participated in The CADE ATP System Competition and had impressive results in that competition. It is programmed in the… … Wikipedia
SPASS theorem prover — SPASS is an automated theorem prover for first order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus.References*Citation last1 = Weidenbach | first1 = Christoph last2 = Schmidt | … Wikipedia
